Some Zero-One Laws for Gaussian Processes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Natural Zero One Laws for Ordinals Below ε 0

We are going to prove that every ordinal α with ε0 > α ≥ ω satisfies a natural zero one law in the following sense. For α < ε0 let Nα be the number of occurences of ω in the Cantor normal form of α. (Nα is then the number of edges in the unordered tree which can canonically be associated with α.) We prove that for any α with ω ≤ α < ε0 and any sentence φ in the language of linear orders the lim...

متن کامل

On Zero-one Laws

An extension of a topological zero-one law due to M. and K.P.S. Bhaskara Rao and of the Hewitt-Savage zero-one law is presented. In [8] M. and K.P.S. Bhaskara Rao proved the following topological zeroone law, which we shall refer to as the Bhaskara Rao zero-one law. Theorem 1. Let X be a topological space and let $ be a group of homeomorphisms of X onto itself with the property that for any two...

متن کامل

Sufficient Conditions for Zero-one Laws

We generalize a result of Bateman and Erdős concerning partitions, thereby answering a question of Compton. From this result it follows that if K is a class of finite relational structures that is closed under the formation of disjoint unions and the extraction of components, and if it has the property that the number of indecomposables of size n is bounded above by a polynomial in n, then K ha...

متن کامل

Zero-One Laws for Modal Logic

We show that a O-l law holds for propositional modal logic, both for structure validity and frame validity. In the case of structure validity, the result follows easily from the well-known O-l law for first-order logic. However, our proof gives considerably more information. It leads to an elegant axiomatization for almost-sure structure validity and to sharper complexity bounds. Since frame va...

متن کامل

Hereditary Zero-One Laws for Graphs

We consider the random graph M n ¯ p on the set [n], were the probability of {x, y} being an edge is p |x−y| , and ¯ p = (p 1 , p 2 , p 3 , ...) is a series of probabilities. We consider the set of all ¯ q derived from ¯ p by inserting 0 probabilities to ¯ p, or alternatively by decreasing some of the p i. We say that ¯ p hereditarily satisfies the 0-1 law if the 0-1 law (for first order logic)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1973

ISSN: 0091-1798

DOI: 10.1214/aop/1176996982